637. Average of Levels in Binary Tree.go

package leetcode

import (
"github.com/halfrost/LeetCode-Go/structures"
)

// TreeNode define
typeTreeNode= structures.TreeNode

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 * Val int
 * Left *TreeNode
 * Right *TreeNode
 * }
 */

funcaverageOfLevels(root*TreeNode) []float64 {
ifroot==nil {
return []float64{0}
 }
queue:= []*TreeNode{}
queue=append(queue, root)
curNum, nextLevelNum, res, count, sum:=1, 0, []float64{}, 1, 0
forlen(queue) !=0 {
ifcurNum>0 {
node:=queue[0]
ifnode.Left!=nil {
queue=append(queue, node.Left)
nextLevelNum++
 }
ifnode.Right!=nil {
queue=append(queue, node.Right)
nextLevelNum++
 }
curNum--
sum+=node.Val
queue=queue[1:]
 }
ifcurNum==0 {
res=append(res, float64(sum)/float64(count))
curNum, count, nextLevelNum, sum=nextLevelNum, nextLevelNum, 0, 0
 }
 }
returnres
}